Dynamic Capacity Allocation to Customers Who Remember Past Service
نویسندگان
چکیده
We study the problem faced by a supplier deciding how to dynamically allocate limited capacity among a portfolio of customers who remember the fill rates provided to them in the past. A customer’s order quantity is positively correlated with past fill rates. Customers differ from one another in their contribution margins, in their sensitivity to the past, and in their demand volatility. We seek to understand the impacts of these factors on the supplier’s allocation policy. We approach the problem using approximate dynamic programming, by incorporating a dynamic model of customers’ behavioral responses. The model trades off customer characteristics to rationalize the fill rates the firm should target for each customer.
منابع مشابه
Managing the Customer Mix and Crowding for Shared Services via Pricing and Capacity Allocation
We study the pricing and capacity allocation problem of a service provider who serves two distinct customer classes. Customers within each class are inherently heterogeneous in their willingness to pay for service, but their utilities are also affected by the presence of other customers in the system. Specifically, customer utilities depend on how many customers are in the system at the time of...
متن کاملPricing and Capacity Allocation for Shared Services
We study the pricing and capacity allocation problem of a service provider who serves two distinct customer classes. Customers within each class are inherently heterogeneous in their willingness to pay for service, but their utilities are also affected by the presence of other customers in the system. Specifically, customer utilities depend on how many customers are in the system at the time of...
متن کاملDynamic Capacity Management with Substitution
We examine a multiperiod capacity allocation model with upgrading. There are multiple product types, corresponding to multiple classes of demand, and the firm purchases capacity of each product before the first period. Within each period, after demand arrives, products are allocated to customers. Customers who arrive to find that their product has been depleted can be upgraded by at most one le...
متن کاملOptimal Design and Control of Finite-Population Queueing Systems
CHAO DENG: Optimal Design and Control of Finite-Population Queueing Systems (Under the direction of Professor Nilay Tanık Argon and Professor Vidyadhar G. Kulkarni) We consider a service system with a finite population of customers (or jobs) and a service resource with finite capacity. We model this finite-population queueing system by a closed queueing network with two stages. The first stage,...
متن کاملGenetic Algorithm and Particle Swarm Optimization for Solving Balanced Allocation Problem of Third Party Logistics Providers
Third party logistics (3PL) service providers play a growing responsibility in the management of supply chain. The global and competitive business environment of 3PLs has recognized the significance of a speedy and proficient service towards the customers in the past few decades. Particularly in warehousing, distribution, and transportation services, a number of customers anticipate 3PLs to imp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Management Science
دوره 59 شماره
صفحات -
تاریخ انتشار 2013